FPGA implementation of Lempel-Ziv data compression

Lempel-Ziv Dimension for Lempel-Ziv Compression

This paper describes the Lempel-Ziv dimension (Hausdorff like dimension inspired in the LZ78 parsing), its fundamental properties and relation with Hausdorff dimension. It is shown that in the case of individual infinite sequences, the Lempel-Ziv dimension matches with the asymptotical Lempel-Ziv compression ratio. This fact is used to describe results on Lempel-Ziv compression in terms of dime...

Tutorial on Lempel-Ziv Data Compression Algorithm

In many scenario of digital communication and data processing, we may deal with strings of data which have certain structural regularities, making it possible for time-saving techniques of data compression. Given a discrete data source, the data compression problem is first to identify the limitations of the source, and second to devise a coding scheme which will best compress it subject to cer...

Differential Ziv-Lempel Text Compression

We describe a novel text compressor which combines Ziv-Lempel compression and arithmetic coding with a form of vector quantisation. The resulting compressor resembles an LZ-77 compressor, but with no explicit phrase lengths or coding for literals. An examination of the limitations on its performance leads to some predictions of the limits of LZ-77 compression in general, showing that the LZ-77 ...

Bit-Optimal Lempel-Ziv compression

One of the most famous and investigated lossless data-compression scheme is the one introduced by Lempel and Ziv about 40 years ago [23]. This compression scheme is known as ”dictionary-based compression” and consists of squeezing an input string by replacing some of its substrings with (shorter) codewords which are actually pointers to a dictionary of phrases built as the string is processed. ...

Lempel - Ziv Compression of Stru tured Text